Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:
общая лексика
бит чётности, разряд чётности
дополнительный бит, добавляемый для контроля правильности пересылки к каждому байту (или слову) пересылаемых данных, чтобы в зависимости от протокола общее число единиц в байте было чётным или нечётным
разряд четности контрольный
разряд четности проверочный
Смотрите также
общая лексика
контроль чётности
использование чётности для проверки правильности передаваемых данных. Проверка по нечётности (odd parity) стандартно используется при синхронной передаче данных, а проверка по чётности (even parity) - при асинхронной
синоним
Смотрите также
A parity bit, or check bit, is a bit added to a string of binary code. Parity bits are a simple form of error detecting code. Parity bits are generally applied to the smallest units of a communication protocol, typically 8-bit octets (bytes), although they can also be applied separately to an entire message string of bits.
The parity bit ensures that the total number of 1-bits in the string is even or odd. Accordingly, there are two variants of parity bits: even parity bit and odd parity bit. In the case of even parity, for a given set of bits, the bits whose value is 1 are counted. If that count is odd, the parity bit value is set to 1, making the total count of occurrences of 1s in the whole set (including the parity bit) an even number. If the count of 1s in a given set of bits is already even, the parity bit's value is 0. In the case of odd parity, the coding is reversed. For a given set of bits, if the count of bits with a value of 1 is even, the parity bit value is set to 1 making the total count of 1s in the whole set (including the parity bit) an odd number. If the count of bits with a value of 1 is odd, the count is already odd so the parity bit's value is 0. Even parity is a special case of a cyclic redundancy check (CRC), where the 1-bit CRC is generated by the polynomial x+1.